Eliminating Dead Code on Re ursive Data ?

نویسنده

  • Yanhong A. Liu
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

State update transformation

Re ursive predi ates frequently generate some state whi h is updated after the re ursive all. We present a sour e to sour e transformation whi h an move the state update before to the re ursive all, thus helping to make the predi ate tail re ursive, and report on its implementation in the Merury ompiler.

متن کامل

Dead Code Elimination through Dependent Types

Pattern matching is an important feature in various functional programming languages such as SML, Caml, Haskell, etc. In these languages, unreachable or redundant matching clauses, which can be regarded as a special form of dead code, are a rich source for program errors. Therefore, eliminating unreachable matching clauses at compile-time can signiicantly enhance program error detection. Furthe...

متن کامل

Source Code Survival with the Kaplan Meier Estimator

The presence of dead code may affect the comprehensibility, the readability, and the size of source code so increasing the effort and the cost for maintenance. The elimination of dead code needs a huge cost and effort for recognizing and eliminating code that is not effectively used. The goal of this work consists in defining an approach based on the Kaplan Meier estimator to analyze dead code....

متن کامل

Eliminating Dead Code on Recursive Data

This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using liveness patterns based on general regular tree grammars extended with the notion of live and dead, and we formulate the analysis as computing liveness patterns at all program points based on constraints constructed from t...

متن کامل

Optimal Distribution Assignment Placement

Dynamic data redistribution is a key technique for maintaining data locality and workload balance in data-parallel languages like HPF. On the other hand, redistributions can be very expensive and signiicantly degrade a program's performance. In this article, we present a novel and aggressive approach for avoiding unnecessary remappings by eliminating partially dead and partially redundant distr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001